Prime-Implicant Extraction with the Aid of the Variable-Entered Karnaugh Map
نویسنده
چکیده
تايوتحملا ةريغتم هونراك ةطيرخ دعت ) ح غ ك خ ( ةـيريوصت اـيازم تاذ ةلاعف ةيودي ةادأ طسوتملا مجحلا تاوذ نم ةديدع تاقيبطت تاذو ةريثك ةيميلعتو . ءارـجإ هذـه ثحبلا ةقرو مدقت اركتبم لوصحلل ةطيرخلا هذه مدختسي ىلع عيمج تانماضلا ةيلولأا ) قاقتـشا مـث نـمو لماكلا عومجملا ( ديدحتلا ةلماك ريغ ةينلاوب ةلادل g ∨ d(h) . ةطيرخ لامعتساب ءارجلإا اذه أدبي ةـلادلل ةـيعرفلا ةلادلا لثمي لماك عومجم ةروص يف اهيف لخدم لك تايوتحملا ةريغتم هونراك ديدحتلا ةلماك ةينلاوبلا g ∨ h ةيلصلأا ةلادلاب ةطبترملا . ةلماكلا تاماهسلإا قاقتشا متي ،كلذ دعب يـتلا تايوتحملا ةريغتم طئارخلا يف رهظت ةديدج تلاخدم ةيأ تاماهسإ كلذكو ،تلاخدملا هذهل ديدحتلا ةلماك ةيلصلأا ةلادلل ةيفطعلا تافذاحلا وأ لباقتلا تاقتشم لثمت . لك نيب ةنراقملا ةمهم نإ نـكمي ام لقأ ىلإ اهريغصت متي رخلآل امهدحأ صاصتما ةيناكمإ فاشتكلا دودحلا نم نيجوز . ةـسارد بـلطتتو ةاطعملا ةلادلل لماكلا بورضملا جتنت يلصلأا ءارجلإل ةجوازم ةروص ةمثو ةيلصفلا تافذاحلاب اضيأ ىمست يتلاو اهل مامضنلاا تاقتشمل . لودعلا نكمي ةصاخ فورظ تحتو اينمض ةلخدملا تابورضملا تاماهسإ ةسارد ىلإ تافذاحلا وأ تاقتشملا لامعتسا نع . ءاطعإ متي اـمهتيلاعفو ام هتيافك ناـيبلو نيحرتقملا ني ءارجلإا تاوطخو دعاوق حيضوتل نيلصفنم نيلاثم ةمئاقلا ةيباسحملا تايجمربلل نيتلمكم نيتيودي نيتادأ امهفصوب . حـملاملا اضيأ نلااثملا حضويو عم لماعتلا ىلع ةطيرخلا ةردقم لمشت يتلاو تايوتحملا ةريغتم هونراك ةطيرخل ةديدعلا ةباذجلا يذ ليدبتلا ربج ريغ ةريبكلا ينلاوبلا ربجلا مظنل اهقيبطت ةيناكمإو ،تاريغتملا نم فعاضم ددع اعم ربجلاو ةطيرخلا يبولسأ نيب جمدلا يف اهتيلاعف كلذكو ،نيرصنعلا .
منابع مشابه
Efficient Solution of Boolean Equations Using Variable-Entered Karnaugh Maps
A new method for obtaining a compact subsumptive general solution of a system of Boolean equations is presented. The method relies on the use of the variable-entered Karnaugh map (VEKM) to achieve successive elimination through successive map folding. It also makes an artificial distinction between don’t-care and can’t-happen conditions. Therefore, it is highly efficient as it requires the cons...
متن کاملAutomated Minimization of BTS Pass Networks
Pass transistor logic has advantages over conventional CMOS logic in terms of area, timing and power consumption. Binary Tree Structured pass networks are a special class of highly structured pass transistor networks. A design technique is presented for automated minimization of BTS pass networks which approaches the optimal solution. The design procedure is described using Karnaugh maps and pa...
متن کاملFUZZY MAPS AND THEIR APPLICATION IN THE SIMPLIFICATION OF FUZZY SWITCIIING FUNCTIONS by
In Boolean logic, a Karnaugh map may be regarded either as a pictorial form of a trugh table, or as an extension of the Venn diagram. However, when fuzzy logic is concerned another minimization method is required, and therefore an extension of a Karnaugh map is investigated. In this paper a new minimization algorithm is developed in order to remove the existing disadvantage of simplifying fuzzy...
متن کاملModified Quine-McCluskey Method
The digital gates are basic electronic component of any digital circuit. Digital circuit should be simplified in order to reduce its cost by reducing number of digital gates required to implement it. To achieve this, we use Boolean expression that helps in obtaining minimum number of terms and does not contain any redundant pair. Karnaugh map (K-map) and Quine-McCluskey (QM) methods are well kn...
متن کاملA Novel Essential Prime Implicant Identification Method for Exact Direct Cover Logic Minimization
Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime implicants that covers the chosen minterm; third, it identifies the essential prime implicant; and fourth, it performs a covering operation. In this study, we focus on the third step and propose a new essential prime implica...
متن کامل